Random graph generation for scheduling simulations

نویسندگان

  • Daniel Cordeiro
  • Grégory Mounié
  • Swann Perarnau
  • Denis Trystram
  • Jean-Marc Vincent
  • Frédéric Wagner
چکیده

In parallel and distributed systems, validation of scheduling heuristics is usually done by simulation on randomly generated synthetic workloads, typically represented by task graphs. Since there is no single generation method that models all possible workloads for scheduling problems, researchers often re-implement the classical generation algorithms or even implement ad hoc ones. A bad choice of generation method can mislead the validation of the algorithm due to biases it can induce. Moreover, different implementations of the same randomized generation method may produce slightly different graphs. These problems can harm the experimental comparison of scheduling algorithms. In order to provide a comparison basis we propose GGen – a unified and standard implementation of classical task graph generation methods used in the scheduling domain. We also provide an in-depth analysis of each generation method, emphasizing important graph properties that may influence scheduling algorithms.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Scheduling security constraint unit commitment for power system including stochastic wind power generation

This paper introduces a new approach for scheduling security constraint unit commitment (SCUC) including wind farms. Because of uncertainty in wind power production, we tried to develop a new method for incorporating wind power generation in power plant scheduling. For this, wind power generation modeled with unit commitment in a non-linear optimization problem and simulated by submitting diffe...

متن کامل

arallel Algorithm for Compile-Time Scheduling of Parallel Programs on Multiprocessors

In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by directed acyclic graphs (DAGs) during compile-time. The PFAST algorithm has O ( e ) time complexity where e is the number of edges in the DAG. This linear-time algorithm works by first generating an initial solution and then r...

متن کامل

Generation Scheduling in Large-Scale Power Systems with Wind Farms Using MICA

The growth in demand for electric power and the rapid increase in fuel costs, in whole of theworld need to discover new energy resources for electricity production. Among of the nonconventionalresources, wind and solar energy, is known as the most promising deviceselectricity production in the future. In this thesis, we study follows to long-term generationscheduling of power systems in the pre...

متن کامل

برنامه‌ریزی همزمان انرژی و ذخیره‌ کنترل فرکانس اولیه با لحاظ کردن قابلیت‌های فنی واحدهای نیروگاهی پیشرفته

Load frequency control includes the operating system and functions that provide real time balance of load and generation. On the other hand, depending on technical capabilities and operational constraints, generating units may be classified for participating in frequency control. Simultaneous scheduling of generation together with primary reserve, in market based power system, has been investig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010